Sublogarithmic Ambiguity
نویسنده
چکیده
So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f : N → N there is a context-free language L with a divergent inherent ambiguity function g below f . This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context-free language L with infinite inherent ambiguity below log∗.
منابع مشابه
For completeness, sublogarithmic space is no space
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are isomorphic under first-order reductions.
متن کاملComments on Integer Sorting on Sum-CRCW
Given an array X of n elements from a restricted domain of integers [1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments on the algorithm. The first comment is the algorithm not runs in sublogarithmic time for any distribution of input da...
متن کاملNovel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
Using the notions of Q-heaps and fusion trees developed by Fredman and Willard, we develop general transformation techniques to reduce a number of computational geometry problems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading technique, which uses linear space and enables sublogarithmic iterative search on catalog trees in the case wh...
متن کاملSearchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency
We propose the first linear-space searchable encryption scheme with constant locality and sublogarithmic read efficiency, strictly improving the previously best known read efficiency bound (Asharov et al., STOC 2016) from Θ(logN log logN) to O(log N) where γ = 2 3 + δ for any fixed δ > 0. Our scheme employs four different allocation algorithms for storing the keyword lists, depending on the siz...
متن کاملOptimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
We assume a parallel RAM model which allows both concurrent reads and concurrent writes of a global memory. Our main result is an optimal randomized parallel algorithm for INTEGER SORT (i.e., for sorting n integers in the range [1; n]). Our algorithm costs only logarithmic time and is the rst known that is optimal: the product of its time and processor bounds is upper bounded by a linear functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 345 شماره
صفحات -
تاریخ انتشار 2004